基于数据质量评价的目标估计

针对目标估计过程需要大量人工参与、自动化程度低的问题，提出了基于数据质量评价的目标估计方法。利用目标数据质量评价方法，对不同传感器得到的目标数据质量进行科学、有效的测度和评价，并根据质量得分动态调整各数据源在目标估计过程中所占的权重，从而减少人工干预，提高目标估计效能。仿真试验结果证明了该方法的有效性。     

Mutual information maximizing GAN inversion for real face with identity preservation

Recent generative adversarial networks (GANs) have yielded remarkable performance in face image synthesis. GAN inversion embeds an image into the latent space of a pretrained generator, enabling it to be used for real face manipulation. However, current inversion approaches for real faces suffer the dilemma of initialization collapse and identity loss. In this paper, we propose a hierarchical GAN inversion for real faces with identity preservation based on mutual information maximization. We first use a facial domain guaranteed initialization to avoid the initialization collapse. Furthermore, we prove that maximizing the mutual information between inverted faces and their identities is equivalent to minimizing the distance between identity features from inverted and original faces. Optimization for real face inversion with identity preservation is implemented on this mutual information-maximizing constraint. Extensive experimental results show that our approach outperforms state-of-the-art solutions for inverting and editing real faces, particularly in terms of face identity preservation.     

控制爆破法处理卡钻事故

介绍了在包头市某工程实施管道穿越黄河施工中,采用爆破法处理卡钻的经验。针对深水环境条件及钻杆内径小不宜采用集团装药的条件,确定采用"小直径爆破筒,钻杆内部装药"的爆破方案,阐述了爆破设计及施工注意事项。可供类似工程参考。     

快速近似计算Shapley值的归因解释方法

Shapley值归因解释方法虽然能更准确量化解释结果, 但过高的计算复杂度严重影响了该方法的实用性. 本文引入KD树重新整理待解释模型的预测数据, 通过在KD树上插入虚节点, 使之满足TreeSHAP算法的使用条件, 在此基础上提出了KDSHAP方法. 该方法解除了TreeSHAP算法仅能解释树结构模型的限制, 将该算法计算Shapley值的高效性放宽到对所有的黑盒模型的解释中, 同时保证了计算准确度. 通过实验对比分析, KDSHAP方法的可靠性, 以及在解释高维输入模型时的适用性.     

IRS辅助的SWIPT系统中基于能效优先的波束成形设计与优化

以智能反射面(intelligent reflecting surface,IRS)辅助的无线携能通信(simultaneous wireless information and power transfer,SWIPT)系统为背景,研究了该系统中基于能效优先的多天线发送端有源波束成形与IRS无源波束成形联合设计与优化方法。以最大化接收端的最小能效为优化目标,构造在发送端功率、接收端能量阈值、IRS相移等多约束下的非线性优化问题,用交替方向乘子法(alternating direction method of multipliers,ADMM)求解。采用Dinkelbach算法转化目标函数,通过奇异值分解(singular value decomposition,SVD)和半定松弛(semi-definite relaxation,SDR)得到发送端有源波束成形向量。采用SDR得到IRS相移矩阵与反射波束成形向量。结果表明,该系统显著降低了系统能量收集(energy harvesting,EH)接收端的能量阈值。当系统总电路功耗为?15 dBm时,所提方案的用户能效为300 KB/J。当IRS反射阵源数与发送天线数均为最大值时,系统可达最大能效。     

Locating wind farm for power and hydrogen production based on Geographic information system and multi-criteria decision making method: An application

Hydrogen generation from renewable energy resources is considered as a suitable solution to solve the problems related to the energy sector and the reduction of greenhouse gases. The aim of this study is to provide an integrated framework for identifying suitable areas for the construction of wind farms to produce hydrogen. For this purpose, a combined method of Geographic Information System (GIS) and multi-criteria decision making (MCDM) has been used to locate the power plant in Yazd province. The GIS method in the present study consisted of two parts: constraints and criteria. The constraint section included areas that were unsuitable for the construction of wind farms to produce power and hydrogen. In the present study, various aspects such as physical, economic and environmental had been considered as constraints. In the criteria section, eight different criteria from technical aspects (including average wind speed, hydrogen production potential, land slope) and economic aspects (including distance to electricity grid, distance to urban areas, distance to road, distance to railway and distance to centers of High hydrogen consumption) had been investigated. The MCDM tool had been used to weigh the criteria and identify suitable areas. Analytic Hierarchy Process (AHP) technique was used for weighting the criteria. The results of AHP weighting method showed that economic criteria had the highest importance with a value of 0.681. The most significant sub-criterion was the distance to urban areas and the least significant sub-criterion was the distance to power transmission lines. The results of GIS-MCDM analysis had shown that the most proper areas were in the southern and central sectors of Yazd province. In addition, the feasibility of hydrogen production from wind energy had shown that this province had the capacity to generate hydrogen at the rate of 53.6–128.6 tons per year.     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.     

Microstructural and mechanical properties assessment of transient liquid phase bonding of CoCuFeMnNi high entropy alloy

The transient liquid phase (TLP) bonding of CoCuFeMnNi high entropy alloy (HEA) was studied. The TLP bonding was performed using AWS BNi-2 interlayer at 1050 °C with the TLP bonding time of 20, 60, 180 and 240 min. The effect of bonding time on the joint microstructure was characterized by SEM and EDS. Microstructural results confirmed that complete isothermal solidification occurred approximately at 240 min of bonding time. For samples bonded at 20, 60 and 180 min, athermal solidification zone was formed in the bonding area which included Cr-rich boride and Mn₃Si intermetallic compound. For all samples, the γ solid solution was formed in the isothermal solidification zone of the bonding zone. To evaluate the effect of TLP bonding time on mechanical properties of joints, the shear strength and micro-hardness of joints were measured. The results indicated a decrement of micro-hardness in the bonding zone and an increment of micro-hardness in the adjacent zone of joints. The minimum and maximum values of shear strength were 100 and 180 MPa for joints with the bonding time of 20 and 240 min, respectively.     

珠江口盆地珠一坳陷古近系高自然伽马砂岩形成机制及油气地质意义

运用放射性元素寻找油气是一种非常规油气勘探手段。近年来,在珠江口盆地珠一坳陷富烃凹陷周边古近系钻遇高自然伽马(GR)砂岩,其GR值(100~300 API)甚至大于同区泥岩的GR值(100~200 API)。为了弄清该特殊现象背后的地质意义,对珠江口盆地珠一坳陷古近系高自然伽马砂岩开展了铀(U)、钍(Th)、钾(K)等3种元素含量与GR值的相关趋势线分析,从井震特征、岩性特征及矿物成分特征等入手分析了砂岩GR值增高的主要原因及成因机制,探讨了放射性元素聚集的条件、运移通道、驱动力以及油气意义。结果表明:西江、惠州地区由U含量增高导致砂岩GR值偏高,恩平、番禺地区由K,Th含量增高导致砂岩GR值偏高;砂岩GR值增高有两大成因机制,一是地下流体带来的放射性元素离子U4+在氧化-还原面处富集后导致地层GR值偏高,这种特殊现象说明在具有连通基底大断裂旁的圈闭中,U4+的富集指示了曾经油气的存在,证实了研究区油气运移通道的有效性,对于油气藏的预测有着非常重要的指导性意义,二是地表流体带来的含放射性元素的矿物大量沉积后导致地层GR值偏高,含放射性元素矿物性质不稳定,可指示近源供给的存在,对于判断物源及沉积环境有着非常重要的意义。该研究成果为预测研究区油气成藏有利区带提供了依据。     

高熵形状记忆合金的研究进展

高熵形状记忆合金是在等原子比NiTi合金的基础上,结合高熵合金的概念,逐渐发展起来的一种新型高温形状记忆合金。近年来,已开发出了综合性能优异的(TiZrHf)50(NiCoCu)50系和(TiZrHf)50(NiCuPd)50系高熵形状记忆合金,引起了广泛的关注和研究兴趣。本文从物相组成、微观组织、马氏体相变行为、形状记忆效应和超弹性等角度出发,综述了高熵形状记忆合金的研究进展,并对高熵形状记忆合金未来的研究重点进行了展望。